On the intersection of three or four transversals of the back circulant latin squares

نویسنده

  • Trent G. Marbach
چکیده

Cavenagh and Wanless [Discrete Appl. Math. 158 no. 2 (2010), 136–146] determined the possible intersection of any two transversals of the back circulant latin square Bn, and used the result to completely determine the spectrum for 2-way k-homogeneous latin trades. We generalize this problem to the intersection of μ transversals of Bn such that the transversals intersect stably (that is, the intersection of any pair of transversals is independent of the choice of the pair) and show that these structures can be used to construct μ-way k-homogeneous circulant latin trades of odd order. We provide a number of basic existence and non-existence results for μ transversals of Bn that intersect stably, as well as the results of a computational search for small n. This is followed by the principal results of this paper: a construction that covers a large portion of the spectrum when n is sufficiently large, which requires certain base designs. These base designs are provided in the cases μ = 3, 4, and were found by a computational search. We use this result to find the existence of μ-way k-homogeneous circulant latin trades of odd order, for μ = 3, 4.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On chromatic number of Latin square graphs

The chromatic number of a Latin square is the least number of partial transversals which cover its cells. This is just the chromatic number of its associated Latin square graph. Although Latin square graphs have been widely studied as strongly regular graphs, their chromatic numbers appear to be unexplored. We determine the chromatic number of a circulant Latin square, and find bounds for some ...

متن کامل

Back circulant Latin squares and the influence of a set

We define the notions of nest and influence of a subset of a critical set of a back circulant latin square, and study their properties. We also show that a secret sharing scheme based on a critical set of a latin square is both compartmentalised, and hierarchical.

متن کامل

More mutually orthogonal Latin squares

A diagonal Latin square is a Latin square whose main diagonal and back diagonal are both transversals. In this paper we give some constructions of pairwise orthogonal diagonal Latin squares. As an application of such constructions we obtain some new infinite classes of pairwise orthogonal diagonal Latin squares which are useful in the study of pairwise orthogonal diagonal Latin squares.

متن کامل

On the number of transversals in Cayley tables of cyclic groups

It is well known that if n is even, the addition table for the integersmodulo n (whichwe denote by Bn) possesses no transversals.We show that ifn is odd, then the number of transversals in Bn is at least exponential in n. Equivalently, for odd n, the number of diagonally cyclic latin squares of order n, the number of completemappings or orthomorphisms of the cyclic group of order n, the number ...

متن کامل

On the existence of self-orthogonal diagonal Latin squares

A diagonal Latin square is a Latin square whose main diagonal and back diagonal are both transversals. A Latin square is self-orthogonal if it is orthogonal to its transpose. In an earlier paper Danhof, Phillips and Wallis considered the question of the existence of self-orthogonal diagonal Latin squares of order 10. In this paper we shall present some constructions of self-orthogonal diagonal ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 65  شماره 

صفحات  -

تاریخ انتشار 2016